Hitting minors on bounded treewidth graphs. II. Single-exponential algorithms
نویسندگان
چکیده
منابع مشابه
Optimal Algorithms for Hitting (Topological) Minors on Graphs of Bounded Treewidth
For a fixed collection of graphs F , the F-M-Deletion problem consists in, given a graph G and an integer k, decide whether there exists S ⊆ V (G) with |S| ≤ k such that G \ S does not contain any of the graphs in F as a minor. We are interested in the parameterized complexity of F-M-Deletion when the parameter is the treewidth of G, denoted by tw. Our objective is to determine, for a fixed F ,...
متن کاملHitting Forbidden Subgraphs in Graphs of Bounded Treewidth
We study the complexity of a generic hitting problem HSubgraph Hitting, where given a fixed pattern graph H and an input graph G, we seek for the minimum size of a set X ⊆ V (G) that hits all subgraphs of G isomorphic to H. In the colorful variant of the problem, each vertex of G is precolored with some color from V (H) and we require to hit only H-subgraphs with matching colors. Standard techn...
متن کاملAlgorithms for Graphs of (Locally) Bounded Treewidth
Many real-life problems can be modeled by graph-theoretic problems. These graph problems are usually NP-hard and hence there is no efficient algorithm for solving them, unless P= NP. One way to overcome this hardness is to solve the problems when restricted to special graphs. Trees are one kind of graph for which several NP-complete problems can be solved in polynomial time. Graphs of bounded t...
متن کاملKnown Algorithms on Graphs on Bounded Treewidth are Probably Optimal
We obtain a number of lower bounds on the running time of algorithms solving problems on graphs of bounded treewidth. We prove the results under the Strong Exponential Time Hypothesis of Impagliazzo and Paturi. In particular, assuming that SAT cannot be solved in (2−ǫ)m time, we show that for any ǫ > 0; • INDEPENDENT SET cannot be solved in (2 − ǫ)tw(G)|V (G)| time, • DOMINATING SET cannot be s...
متن کاملGeneralized Feedback Vertex Set Problems on Bounded-Treewidth Graphs: Chordality Is the Key to Single-Exponential Parameterized Algorithms
It has long been known that Feedback Vertex Set can be solved in time 2Opw logwqnOp1q on graphs of treewidth w, but it was only recently that this running time was improved to 2OpwqnOp1q, that is, to single-exponential parameterized by treewidth. We investigate which generalizations of Feedback Vertex Set can be solved in a similar running time. Formally, for a class of graphs P, the Bounded P-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2020
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2020.01.026